A Solution to the 4-bit Parity Problem with a Single Quaternary Neuron
نویسنده
چکیده
Abstract This letter will clarify the fundamental properties of a quaternary neuron whose weights, threshold values, input and output signals are all quaternions, which is an extension of a usual real-valued neuron to quaternions. The main results of this letter are summarized as follows. A quaternary neuron has an orthogonal decision boundary. The 4-bit parity problem which cannot be solved with a single usual real-valued neuron, can be solved with a single quaternary neuron with the orthogonal decision boundary, resulting in the highest generalization ability.
منابع مشابه
N-bit parity neural networks: new solutions based on linear programming
In this paper, the N -bit parity problem is solved with a neural network that allows direct connections between the input layer and the output layer. The activation function used in the hidden and output layer neurons is the threshold function. It is shown that this choice of activation function and network structure leads to several solutions for the 3-bit parity problem using linear programmi...
متن کاملGeneric parity generators design using LTEx methodology: A quantum-dot cellular automata based approach
Quantum-dot Cellular Automata (QCA) is a prominent paradigm that is considered to continue its dominance in thecomputation at deep sub-micron regime in nanotechnology. The QCA realizations of five-input Majority Voter based multilevel parity generator circuits have been introduced in recent years. However, no attention has been paid towards the QCA instantiation of the generic (n-bit) even and ...
متن کاملGeneric parity generators design using LTEx methodology: A quantum-dot cellular automata based approach
Quantum-dot Cellular Automata (QCA) is a prominent paradigm that is considered to continue its dominance in thecomputation at deep sub-micron regime in nanotechnology. The QCA realizations of five-input Majority Voter based multilevel parity generator circuits have been introduced in recent years. However, no attention has been paid towards the QCA instantiation of the generic (n-bit) even and ...
متن کاملOn the solution of the parity problem by a single hidden layer feedforward neural network
It is known that the N-bit parity problem is solvable by a standard feed-forward neural network having a single hidden layer consisting of (N/2) + 1 hidden units if N is even and (N+1)/2 hidden units if N is odd. The network does not allow a direct connection between the input layer and the output layer and the transfer function used in all hidden units and the output unit is the usual sigmoida...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کامل